import java.util.HashMap;
import java.util.Stack;

public class Test {
    public static void main(String[] args) {
        int[]arr=new int[]{2,1,5,6,2,3};
        Solution solution=new Solution();
        solution.largestRectangleArea(arr);
    }
    public static void main4(String[] args) {
        char[][] arr=new char[][]{{'A','B','C','E'},{'S','F','C','S'},{'A','D','E','E'}};
        String ret="ABCB";
        Solution solution=new Solution();
        solution.exist(arr,ret);
    }
    public static void main3(String[] args) {
        Solution solution=new Solution();
        solution.canPartition(new int[]{1,2,5});
        HashMap<Integer,Integer> map=new HashMap<>();
    }
    public static void main2(String[] args) {
        Stack<Integer>stack=new Stack<>();
        stack.push(1);
        System.out.println(stack.pop());
    }
    public static void main1(String[] args) {
        Solution solution=new Solution();
        solution.minWindow("ADOBECODEBANC","ABC");
        String ret="adcf";
        System.out.println(ret.contains("df"));
    }
}
